Graph-Counting Polynomials for Oriented Graphs
نویسندگان
چکیده
منابع مشابه
Reconstructing subgraph-counting graph polynomials of increasing families of graphs
A graph polynomial P (G, x) is called reconstructible if it is uniquely determined by the polynomials of the vertex deleted subgraphs of G for every graph G with at least three vertices. In this note it is shown that subgraph-counting graph polynomials of increasing families of graphs are reconstructible if and only if each graph from the corresponding defining family is reconstructible from it...
متن کاملOrbit-counting polynomials for graphs and codes
We construct an “orbital Tutte polynomial” associated with a dual pair M and M∗ of matrices over a principal ideal domain R and a group G of automorphisms of the row spaces of the matrices. The polynomial has two sequences of variables, each sequence indexed by associate classes of elements of R. In the case where M is the signed vertex-edge incidence matrix of a graph Γ over the ring of intege...
متن کاملOn Counting Polynomials of Some Nanostructures
The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.
متن کاملCounting Plane Graphs: Cross-Graph Charging Schemes
We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have been recently applied to obtain various properties of triangulations that are embedded over a fixed set of points in the plane. We show how this method can be generalized to obtain results for various other types of graphs t...
متن کاملCounting Hamilton decompositions of oriented graphs
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamiltonian decomposition of G is a partition of its edge set into disjoint Hamilton cycles. In the late 60s Kelly conjectured that every regular tournament has a Hamilton decomposition. This conjecture was recently settled by Kühn and Osthus [15], who proved more generally that every r-regular n-vertex o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2018
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-018-2137-3